The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
نویسندگان
چکیده
We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.
منابع مشابه
A simplified setting for discrete logarithms in small characteristic finite fields
We present an algorithm for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This has important applications in cryptography, where groups of prime order are used as the basis for discrete-log based cryptosystems. For a quartic CM field K with primitive CM type, we compute the Igusa class polynomials modulo p for certain small primes p and then use ...
متن کاملCounting Solutions to Discrete Non-Algebraic Equations Modulo Prime Powers
As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is thought that the functions that such schemes use have inverses that are computationally intractable. In relation to this, we are interested in counting the so...
متن کاملOn the discrete logarithm problem in elliptic curves II
We continue our study on the elliptic curve discrete logarithm problem over finite extension fields. We show, among other results, the following two results: For sequences of prime powers (qi)i∈N and natural numbers (ni)i∈N with ni −→ ∞ and ni log(qi) −→ 0 for i −→ ∞, the discrete logarithm problem in the groups of rational points of elliptic curves over the fields Fqi i can be solved in subexp...
متن کاملOn the discrete logarithm problem in elliptic curves
We study the elliptic curve discrete logarithm problem over finite extension fields. We show that for any sequences of prime powers (qi)i∈N and natural numbers (ni)i∈N with ni −→ ∞ and ni log(qi) −→ 0 for i −→ ∞, the elliptic curve discrete logarithm problem restricted to curves over the fields Fqi i can be solved in subexponential expected time (qi i ) . We also show that there exists a sequen...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016